Higher-order learning
نویسندگان
چکیده
Abstract We design a novel experiment to study how subjects update their beliefs about the of others. Three players receive sequential signals an unknown state world. Player 1 reports her state; 2 simultaneously 1; 3 2. say that exhibit higher-order learning if k $$k-1$$ k - 1 become more accurate as are observed. find some predicted dynamics reflected in data; particular, updated slowly with private than public information. However, fails even after large number is argue this result driven by base-rate neglect, heterogeneity updating processes, and subjects’ failure correctly take rules others into account.
منابع مشابه
Evolutionary Higher-Order Concept Learning
Current concept learners are limited in their applicability as they generally rely on comparatively poor knowledge representation facilities (e.g. attribute value pairs, flattened horn clauses). The work carried out in support of my thesis has involved extending concept learning to a higher order setting by developing a novel representation based on closed Escher terms for highly structured dat...
متن کاملLearning in Higher-Order "Artificial Dendritic Trees"
If neurons sum up their inputs in a non-linear way, as some simulations suggest, how is this distributed fine-grained non-linearity exploited during learning? How are all the small sigmoids in synapse, spine and dendritic tree lined up in the right areas of their respective input spaces? In this report, I show how an abstract atemporal highly nested tree structure with a quadratic transfer func...
متن کاملGradient-based learning of higher-order features
We describe an auto-encoder with multiplicative connections whose hidden variables encode products of pixel intensities. The model allows for efficient learning of image transformations and of higher-order structure within an image-patch. Modelling higher-order structure can be an effective way to improve recognition performance, as shown recently with a similar, probabilistic model of image co...
متن کاملA Higher-order Approach to Meta-learning
Meta-learning, as applied to model selection, consists of inducing mappings from tasks to learners. Traditionally, tasks are characterised by the values of pre-computed meta-attributes, such as statistical and information-theoretic measures, induced decision trees' characteristics and/or landmarkers' performances. In this position paper, we propose to (meta-)learn directly from induced decision...
متن کاملSemi-supervised Learning by Higher Order Regularization
In semi-supervised learning, at the limit of infinite unlabeled points while fixing labeled ones, the solutions of several graph Laplacian regularization based algorithms were shown by Nadler et al. (2009) to degenerate to constant functions with “spikes” at labeled points in R for d ≥ 2. These optimization problems all use the graph Laplacian regularizer as a common penalty term. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Experimental Economics
سال: 2021
ISSN: ['1386-4157', '1573-6938']
DOI: https://doi.org/10.1007/s10683-021-09743-6